Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于PCI总线的多路数据总线接口设计与实现

提出了一种主处理机可以直接控制的1553B总线接口模块的设计与实现方案,并简要介绍了其硬件结构、工作过程和软件开发.利用PCI协议芯片实现PCI局部总线与军用1553B总线的桥接,采用WDM技术编写驱动程序.所设计的总线接口模块符合MIL-STD-1553B总线标准,具有结构简单、成本低廉、操作方便等特点,可用于仿真,开发1553B总线产品.     

基于单元故障模式的水下恒流远供系统可靠性分析方法

以水下单元的短路/开路故障模式为基础,提出了一种分析缆系海底观测网络恒流远供系统可靠性的方法。根据系统供电和结构特性,将系统分成不同的供电链路和链路段。详细研究了处于不同位置的各种水下单元发生故障时,对链路和观测设备的供电状态的影响。归纳了导致系统和各链路无法正常导通、观测设备无法得到供电的状态情况,分析了不同故障状态发生的概率,进而得出了求解系统、供电链路与供电设备的供电可靠度的方法。通过算例分析,进一步梳理了3种供电可靠性的共性规律,说明在设计和建设恒流远供系统时,应综合须考量这3种供电可靠性。     

Flow shop scheduling with earliness,tardiness, and intermediate inventory holding costs

We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment

The ability to cope with uncertainty in dynamic scheduling environments is becoming an increasingly important issue. In such environments, any disruption in the production schedule will translate into a disturbance of the plans for several external activities as well. Hence, from a practical point of view, deviations between the planned and realized schedules are to be avoided as much as possible. The term stability refers to this concern. We propose a proactive approach to generate efficient and stable schedules for a job shop subject to processing time variability and random machine breakdowns. In our approach, efficiency is measured by the makespan, and the stability measure is the sum of the variances of the realized completion times. Because the calculation of the original measure is mathematically intractable, we develop a surrogate stability measure. The version of the problem with the surrogate stability measure is proven to be NP‐hard, even without machine breakdowns; a branch‐and‐bound algorithm is developed for this problem variant. A tabu search algorithm is proposed to handle larger instances of the problem with machine breakdowns. The results of extensive computational experiments indicate that the proposed algorithms are quite promising in performance. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

舰艇导弹武控系统分析

水面舰艇海上作战的主要威胁来自于敌方反舰导弹的攻击,水面舰艇的防空作战能力成为其作战效能的重要指标之一,而武控系统又是舰载防空导弹武器系统的核心。通过分析舰载武控系统的设计原则、种类、内涵等内容,结合武控系统软件的特点,对开放式体系结构在大型复杂军用实时系统中的应用进行了论述,通过分析得出了几个有益的结论。     

Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem

In this paper we propose some non‐greedy heuristics and develop an Augmented‐Neural‐Network (AugNN) formulation for solving the classical open‐shop scheduling problem (OSSP). AugNN is a neural network based meta‐heuristic approach that allows integration of domain‐specific knowledge. The OSSP is framed as a neural network with multiple layers of jobs and machines. Input, output and activation functions are designed to enforce the problem constraints and embed known heuristics to generate a good feasible solution fast. Suitable learning strategies are applied to obtain better neighborhood solutions iteratively. The new heuristics and the AugNN formulation are tested on several benchmark problem instances in the literature and on some new problem instances generated in this study. The results are very competitive with other meta‐heuristic approaches, both in terms of solution quality and computational times. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

“中国特色社会主义理论与实践”课教学创新探讨

新形势对《中国特色社会主义理论与实践》课程教学提出了新要求。开展以"民主开放,求实创新"为特征的教学改革主要内容有:树立"以生为本"的教学新理念;坚守主阵地,创新教学内容;重视能力训练,创新方法手段等,在教学创新中,应着重把握几对辩证关系,解决一些关键问题。     

Scheduling with centralized and decentralized batching policies in concurrent open shops

This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011     

开放式自动测试系统软件设计

实现测试程序的可移植性、改善测试系统仪器互换性和提高ATS新技术注入能力是通用ATS研制的热点问题,遵循标准和实现开放式系统是解决问题的途径,软件系统是当前通用ATS实现开放性的制约因素.根据领域需求软件采用层体系结构模式,合理划分各层功能,在高层提供面向信号的编程接口,资源控制层提供了面向功能的接口,资源管理实现了系统对资源控制层构件开放的动态集成方式,实现了开放式的系统软件构架.